Unification as Constraint Satisfaction in Structured Connectionist Networks
نویسنده
چکیده
Unification is a basic concept in several traditional symbolic formalisms that should be well-suited for a connectionist implementation due to the intuitive nature of the notions it formalizes. It is shown that by approaching unification from a graph matching and constraint satisfaction perspective a natural and efficient realization in a structured connectionist network can be found.
منابع مشابه
Connectionist Approaches to Natural Language Processing
With the growing popularity of statistical approaches to natural language processing, it is natural to consider how connectionist techniques for learning and using soft constraints might be applicable to this area. However, nagging questions about the representational and computational adequacy of connectionist networks for processing language make the fruitfulness of this endeavor uncertain. T...
متن کاملThe Boltzmann Machine as a Neural Model
1. Hinton, Geo rey E., Terrence J. Sejnowski and David H. Ackley, Boltzmann Machines: Constraint Satisfaction Networks that Learn, Technical Report CMU-CS-84-119, May 1984. 2. Simpson, Patrick K., Arti cial Neural Systems: Foundations, Paradigms, Applications, and Implementations, 1990. Chapter 5: ANS Paradigms and Their Applications and Implementations, pages 120-127. 3. Hinton, Geo rey, Lectu...
متن کاملA Structured Connectionist Unification Algorithm
A connectionist unification algorithm is presented. It utilizes the fact that the most general unifier of two terms corresponds to a finest valid equivalence relation defined on a occurrence-label representation of the unification problem. The algorithm exploits the maximal parallelism inherent in the computation of such a finest valid equivalence relation while using only computational feature...
متن کاملLanguage Learning in Massively-Parallel Networks
Massively-parallel connectionist networks have traditionally been applied to constraint-satisfaction in early visual processing (Ballard, Hinton & Sejnowski, 1983), but are now being applied to problems ranging from the TravelingSalesman Problem to language acquisition (Rumelhart & MeClelland, 1986). In these networks, knowledge is represented by the distributed pat tern of activity in a large ...
متن کاملInfinite RAAM: A Principled Connectionist Substrate for Cognitive Modeling
Unification-based approaches have come to play an important role in both theoretical and applied modeling of cognitive processes, most notably natural language. Attempts to model such processes using neural networks have met with some success, but have faced serious hurdles caused by the limitations of standard connectionist coding schemes. As a contribution to this effort, this paper presents ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neural Computation
دوره 1 شماره
صفحات -
تاریخ انتشار 1989